Alexander Razborov - PDFSEARCH.IO - Document Search Engine

Alexander Razborov
Results: 35

#	Item
21	SATISFIABILITY, BRANCH-WIDTH AND TSEITIN TAUTOLOGIES Michael Alekhnovich and Alexander Razborov August 24, 2011 Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2011-08-24 03:35:26
22	Communication Complexity Alexander A. Razborov Abstract. When I was asked to write a contribution for this book about something related to my research, I immediately thought of Communication Complexity. This relatively s Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2011-01-04 02:09:34
23	On the Width of Semi-Algebraic Proofs and Algorithms Alexander Razborov∗ February 12, 2016 Abstract Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2016-02-12 15:40:39
24	A simple proof of Bazzi’s theorem ALEXANDER RAZBOROV University of Chicago In 1990, Linial and Nisan asked if any polylog-wise independent distribution fools any function in AC0 . In a recent remarkable development, Ba Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2009-05-05 13:03:32
25	The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 FLAG ALGEBRAS ALEXANDER A. RAZBOROV Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2009-03-27 12:21:11
26	Real Advantage Alexander Razborov∗ Emanuele Viola† June 3, 2013 Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2013-06-03 16:10:44
27	The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 FLAG ALGEBRAS ALEXANDER A. RAZBOROV Add to Reading List Source URL: www.mi.ras.ru Language: English - Date: 2007-09-07 07:05:56
28	Unprovability of Lower Bounds on Circuit Size in Certain Fragments of Bounded Arithmetic Alexander A. Razborov∗ School of Mathematics Institute for Advanced Study Princeton, NJ 08540 Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2012-01-03 04:10:15 Mathematics FO Finite model theory Symbol
29	The Ackermann Award 2005 Erich Gr¨ adel, Janos Makowsky, and Alexander Razborov Members of EACSL Jury for the Ackermann Award The Ackermann Award Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:16 Automated theorem proving Computability theory Theory of computation Computational complexity theory Logic in computer science Alexander Razborov Wilhelm Ackermann Decidability First-order logic Theoretical computer science Mathematics Logic
30	The Ackermann Award 2009 J.A. Makowsky and A. Razborov Members of EACSL Jury for the Ackermann Award The ﬁfth Ackermann Award is presented at this CSL’09, held in Coimbra, Portugal. This is the third year in which th Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:05 Logic Wilhelm Ackermann Alexander Razborov Proof complexity DPLL algorithm Resolution Computational complexity theory Ackermann function Propositional proof system Theoretical computer science Mathematics Automated theorem proving

UPDATE